Transforming Dependencies into Phrase Structures

نویسندگان

  • Lingpeng Kong
  • Alexander M. Rush
  • Noah A. Smith
چکیده

PTB 23 Model F1 Sent./s. Charniak (2000) 89.5 Stanford PCFG (2003) 85.5 5.3 Petrov (2007) 90.1 8.6 Zhu (2013) 90.3 39.0 Carreras (008) 91.1 CJ Reranking (2005) 91.5 4.3 Stanford RNN (2013) 90.0 2.8 PAD 90.6 34.3 PAD (Pruned) 90.5 58.6 CTB 5 Model F1 Charniak (2000) 80.8 Bikel (2004) 80.6 Petrov (2007) 83.3 Zhu (2013) 83.2 PAD 82.4 Experiments Contributions • A phrase-structure parser (PAD) achieves 0.4% higher f-score on the Penn Treebank and ~7x faster than the Berkeley parser, without reranking or semisupervised training. • An linear observable time algorithm for transforming dependency parse trees into phrase-structure parse trees.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Neural Machine Translation with Source Syntax

Neural Machine Translation (NMT) based on the encoder-decoder architecture has recently achieved the state-of-the-art performance. Researchers have proven that extending word level attention to phrase level attention by incorporating source-side phrase structure can enhance the attention model and achieve promising improvement. However, word dependencies that can be crucial to correctly underst...

متن کامل

Automatic Transformation of Phrase Treebanks to Dependency Trees

Word-to-word dependency structures are useful for consistent representation and comparable evaluation of parsing results. However, most large-scale treebanks contain various variants of phrase structure trees, since automatic parsers usually produce constituent structures. We present a freely available extensible tool for converting phrase structure to dependencies automatically, and discuss it...

متن کامل

Converting Phrase Structures to Dependency Structures in Sanskrit

Two annotations schemes for presenting the parsed structures are prevalent viz. the constituency structure and the dependency structure. While the constituency trees mark the relations due to positions, the dependency relations mark the semantic dependencies. Free word order languages like Sanskrit pose more problems for constituency parses since the elements within a phrase are dislocated. In ...

متن کامل

Extracting Noun Phrases in Subject and Object Roles for Exploring Text Semantics

In tune with the recent developments in the automatic retrieval of text semantics, this paper is an attempt to extract one of the most fundamental semantic units from natural language text. The context is intuitively extracted from typed dependency structures basically depicting dependency relations instead of Part-Of-Speech tagged representation of the text. The dependency relations imply deep...

متن کامل

Phrase Structures and Dependencies for End-to-End Coreference Resolution

We present experiments in data-driven coreference resolution comparing the effect of different syntactic representations provided as features in the coreference classification step: no syntax, phrase structure representations, dependency representations, and combinations of the representation types. We compare the end-to-end performance of a parametrized state-of-the-art coreference resolution ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015